Effective subdirect decomposition: a case study
نویسندگان
چکیده
منابع مشابه
Effective Subdirect Decomposition: A Case Study
Certainly, one of the most fundamental early results in universal algebra is Birkhoff’s 1944 decomposition theorem which states that every (universal) algebra d may be represented as a subdirect product of subdirectly irreducible algebras of the same type. It is clear that for d finite such decompositions may be obtained effectively, at least in principle. At first sight, therefore, one might b...
متن کاملSubdirect Decomposition of n-Chromatic Graphs
It is shown that any n-chromatic graph is a full subdirect product of copies of the complete graphs Kn and Kn+1, except for some easily described graphs which are full subdirect products of copies of Kn+1 − {◦–◦} and Kn+2 − {◦–◦}; full means here that the projections of the decomposition are epimorphic in edges. This improves some results of Sabidussi. Subdirect powers of Kn or Kn+1 − {◦–◦} are...
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولThe Structure of Pseudocomplemented Distributive Lattices. I: Subdirect Decomposition
In this paper all subdirectly irreducible pseudocomplemented distributive lattices are found. This result is used to establish a Stone-like representation theorem conjectured by G. Grätzer and to find all equational subclasses of the class of pseudocomplemented distributive lattices.
متن کاملSubdirect Decomposition of Contexts into Subdirectly Irreducible Factors
The size of a concept lattice may increase exponentially with the size of the context. When the number of nodes is too large, it becomes very difficult to generate and study such a concept lattice. A way to avoid this problem is to break down the lattice into small parts. In the subdirect decomposition, the small parts are factor lattices which are meaningful in the Formal Concept Analysis (FCA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90366-n